Natural Block Data Decomposition for Heterogeneous Clusters
نویسندگان
چکیده
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional grid. This heuristics is an extension of the intuitively clear heterogeneous data distribution for one-dimensional case. It is compared to advanced heuristics for heterogeneous data decomposition proposed for solving linear algebra problems on two-dimensional process grid. We experimentally show that for typical local network (12 Windows 2000 PCs interconnected via Fast Ethernet switch) and for typical linear algebra problems these two heuristics have almost the same efficiency. We demonstrate efficiency of the proposed natural decomposition for case of three-dimensional process grid on the example of 3D modeling of supernova explosion also.
منابع مشابه
Multidimensional Static Block Data Decomposition for Heterogeneous Clusters
We propose general static block and block-cyclic heterogeneous decomposition of multidimensional data over processes of parallel program mapped onto multidimensional process grid. The decomposition is compared with decomposition of two-dimensional data over twodimensional process grid of Beaumont et al and with natural decomposition of three-dimensional data over three-dimensional process grid.
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملBlock Data Decomposition for Partial - Homogeneous
This paper describes a block data partitioning algorithm suited to parallel processing in a heterogeneous network environment where some of the processors have the same performance capacity. Grid problems are particularly suited to block data partitioning schemes where communication cost is reduced by locating a grid point and its neighbors on the same physical processor whenever possible. Our ...
متن کاملBlock Data Decomposition for Data-Parallel Programming on a Heterogeneous Workstation Network
We present a block data decomposition algorithm for two-dimensional grid problems. Our method includes load balancing to accommodate heterogeneous processors, and we characterize the conditions that must be met for our partitioning strategy to be of value. While we concentrate on the workstation network model of parallel processing because of its high communication costs and inherent heterogene...
متن کاملProblem Decomposition in Parallel Networks
The improving computational speed of workstations makes clusters of these machines attractive for parallel computing. The workstation model of parallel processing, however, presents speciic challenges caused by the latency of the communications network and the workload imbalance that arises from the heterogeneity of the nodes. Because of these issues, data partitioning is critically important f...
متن کامل